Version Age of Information in Clustered Gossip Networks

نویسندگان

چکیده

We consider a network consisting of single source and $n$ receiver nodes that are grouped into equal-sized clusters. Each cluster corresponds to distinct community such belong different communities cannot exchange information. use dedicated heads in each facilitate communication between the within cluster. Inside clusters, connected other according given topology. Based on connectivity levels node relays its current stored version update neighboring by local gossiping. disconnected, ring, fully topologies for For these topologies, we characterize average age at find scaling as function size . Next, allowing gossiping among heads, improve nodes. Then, focusing ring topology cluster, introduce hierarchy considered clustered gossip model without using heads. Finally, age-optimum sizes source, head, rates through numerical evaluations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Age of Information in Gossip Networks

We introduce models of gossip based communication networks in which each node is simultaneously a sensor, a relay and a user of information. We model the status of ages of information between nodes as a discrete time Markov chain. In this setting a gossip transmission policy is a decision made at each node regarding what type of information to relay at any given time (if any). When transmission...

متن کامل

Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks

Analytical models exist for evaluating gossip-based information propagation. Up to now these models were developed only for fully connected networks. We provide analytical models for information propagation of a push-pull gossiping protocol in a wireless mesh network. The underlying topology is abstracted away by assuming that the wireless nodes are uniformly deployed. We compare our models wit...

متن کامل

Gossip - based Information Spreading in Mobile and Social Networks

HUANG, YUFAN. Gossip-based Information Spreading in Mobile and Social Networks. (Under the direction of Dr. Huaiyu Dai.) We study the performance of gossip-based information spreading in different network models. Our study is conducted in two major different circumstances: mobile networks and social networks. In mobile networks, we mainly study two problems: single-piece information spreading w...

متن کامل

Asynchronous Gossip in Multiplex Networks

In this work, we take a first step to investigate information spreading in multiplex networks, adopting the gossip (randomwalk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explored the im...

متن کامل

Spreading gossip in social networks.

We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal reachability of the neighbors of a given node that interchange information among each other, and the spreading time needed for the information to reach such a fraction of nodes. When the information refers to a particular node at which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE journal on selected areas in information theory

سال: 2022

ISSN: ['2641-8770']

DOI: https://doi.org/10.1109/jsait.2022.3159745